Compact labelings for efficient first-order model-checking
نویسندگان
چکیده
منابع مشابه
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is nicely locally clique-width-decomposable. This notion generalizes that of a nicely locally tree-decomposable class. The graphs of s...
متن کاملEfficient First-Order Model-Checking Using Short Labels
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, which contains in particular, the nicely locally treedecomposable classes. For every class of bounded expansion we prove that every bounded formula has an O(log(n))-labeling scheme. We also prove that, for fixed k, every ...
متن کاملFirst-Order-CTL Model Checking
This work presents a first-order model checking procedure that verifies systems with potentially infinite data spaces with respect to first-order CTL specification. The procedure relies on a partition of the system variables into control and data. While control values are expanded into BDD-representations, data values enter in form of their properties relevant to the verification task. The algo...
متن کاملSemiring Provenance for First-Order Model Checking
Given a first-order sentence, a model-checking computation tests whether the sentence holds true in a given finite structure. Data provenance extracts from this computation an abstraction of the manner in which its result depends on the data items that describe the model. Previous work on provenance was, to a large extent, restricted to the negation-free fragment of first-order logic and showed...
متن کاملFirst-Order LTL Model Checking Using MDGs
In this paper, we describe a first-order linear time temporal logic (LTL) model checker based on multiway decision graphs (MDG). We developed a first-order temporal language, LMDG∗, which expresses a subset of many-sorted first-order LTL and extends an earlier language, LMDG , defined for an MDG based abstract CTL model checking. We derived a set of rules, enabling the transformation of LMDG∗ f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2009
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-009-9260-7